Unique Parallel Decomposition for the Pi-calculus
نویسندگان
چکیده
منابع مشابه
Unique Parallel Decomposition for the Pi-calculus
A (fragment of a) process algebra satisfies unique parallel decomposition if the definable behaviours admit a unique decomposition into indecomposable parallel components. In this paper we prove that finite processes of the π-calculus, i.e. processes that perform no infinite executions, satisfy this property modulo strong bisimilarity and weak bisimilarity. Our results are obtained by an applic...
متن کاملEvent Structure Semantics of Parallel Extrusion in the Pi-Calculus
We give a compositional event structure semantics of the π-calculus. The main issues to deal with are the communication of free names and the extrusion of bound names. These are the source of the expressiveness of the π-calculus, but they also allow subtle forms of causal dependencies. We show that free name communications can be modeled in terms of “incomplete/potential synchronization” events...
متن کاملOn Unique Decomposition of Processes in the Applied π-Calculus
Unique decomposition has been a subject of interest in process algebra for a long time (for example in BPP [2] or CCS [10, 12]), as it provides a normal form with useful cancellation properties. We provide two parallel decomposition results for subsets of the Applied π-Calculus: We show that a closed finite process P can be decomposed uniquely into prime factors Pi with respect to weak labeled ...
متن کاملPi-nets: interaction nets for pi-calculus
π-calculus is a framework that aims to describe concurrent calculations through a formal definition of processes. Originally, π-calculus is defined by a formal language and a set of reduction rules, much in the spirit of λ-calculus. Our aim is to provide a graphical representation of π-calculus using multi-wired interaction nets, in the spirit this time of proof-nets of linear logic. 1 π-calcul...
متن کاملThe pi-calculus
We formalise the pi-calculus using the nominal datatype package, based on ideas from the nominal logic by Pitts et al., and demonstrate an implementation in Isabelle/HOL. The purpose is to derive powerful induction rules for the semantics in order to conduct machine checkable proofs, closely following the intuitive arguments found in manual proofs. In this way we have covered many of the standa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Proceedings in Theoretical Computer Science
سال: 2016
ISSN: 2075-2180
DOI: 10.4204/eptcs.222.4